A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees

In this paper we focus on problems characterized by an input n-node tree and a collection of subpaths. Motivated by the fact that some of these problems admit a very good approximation (or even a poly-time exact algorithm) when the input tree is a path, we develop a decomposition theorem of trees into paths. Our decomposition allows us to partition the input problem into a collection of O(log logn) subproblems, where in each subproblem either the input tree is a path or there exists a hitting set F of edges such that each path has a non-empty, small intersection with F . When both kinds of subproblems admit constant approximations, our method implies an O(log log n) approximation for the original problem. We illustrate the above technique by considering two natural problems of the mentioned kind, namely Uniform Tree Tollbooth and Unique Tree Coverage. In Uniform Tree Tollbooth each subpath has a budget, where budgets are within a constant factor from each other, and we have to choose non-negative edge prices so that we maximize the total price of subpaths whose budget is not exceeded. In Unique Tree Coverage each subpath has a weight, and the goal is to select a subset X of edges so that we maximize the total weight of subpaths containing exactly one edge of X. We obtain O(log logn) approximation algorithms for both problems. The previous best approximations are O(logn/ log log n) by Gamzu and Segev [ICALP’10] and O(logn) by Demaine et al. [SICOMP’08] for the first and second problem, respectively, however both previous results were obtained for much more general problems with arbitrary budgets (weights).